generating subsets meaning in Chinese
子集生成
Examples
- The proposed algorithm for knapsack problem is based on mimd . the sort algorithm by sampling is introduced in the sorting stage . the stages of generating subset - sum and searching are also optimized
并行背包算法基于mimd结构,在排序过程中引入基于采样的排序算法,然后对子集和生成和搜索过程加以优化。